Long cycles have the edge-Erdős-Pósa property
نویسندگان
چکیده
We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer ` ≥ 3 and every k ∈ N, every graph G either contains k edge-disjoint cycles of length at least ` (long cycles) or an edge set X of size O(k log k + `k) such that G−X does not contain any long cycle. This answers a question of Birmelé, Bondy, and Reed (Combinatorica 27 (2007), 135–145).
منابع مشابه
Frames, A-paths and the Erdős-Pósa property
A key feature of Simonovits’ proof of the classic Erdős-Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to A-paths. With it we deduce a simple proof of Gallai’s theorem, although with a worse bound, and we verify the Erdős-Pósa property for long and for even A-paths. We also show that even A-paths do not ...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملThe survival rate of fiber-reinforced composite inlay bridges after two million load cycles: An in vitro study
The survival rate of fiber-reinforced composite inlay bridges after two million load cycles: An in vitro study Dr. F. Darabi* - Dr. A. Mirfazaelian** - Dr. H. Naseri*** *Assistant Professor of Operative Dentistry Dept. - Faculty of Dentistry – Guilan University of Medical Sciences. **Assistant Professor of Removable Prosthodontics Dept. Faculty of Dentistry – Tehran University of Medical Scienc...
متن کاملThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...
متن کاملOn Neighbor-Property Cycles
Cycles of various lengths composed of elements belonging to a set S can be used to define monocyclic permutations (“round-table seatings”) of subsets of S. Those are interesting by themselves, but the whole context becomes still more interesting when the elements possess specific properties or when pairs of elements of S have a specific property (implying a partition of the product set SxS). In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016